Symmetry in Constraint Optimization∗

نویسنده

  • Toby Walsh
چکیده

Symmetry is an important feature in constraint programming. Whilst there has been considerable progress in dealing with symmetry in constraint satisfaction problems, there has been less attention to symmetry in constraint optimization problems. In this paper, we propose some general methods for dealing with symmetry in constraint optimization problems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constraint-Based Symmetry Detection in General Game Playing

Symmetry detection is a promising approach for reducing the search tree of games. In General Game Playing (GGP), where any game is compactly represented by a set of rules in the Game Description Language (GDL), the state-of-the-art methods for symmetry detection rely on a rule graph associated with the GDL description of the game. Though such rule-based symmetry detection methods can be applied...

متن کامل

Symmetry Breaking by Local Search

The presence of symmetry in constraint satisfaction problems can cause a great deal of wasted search effort, and several methods for breaking symmetries have been reported. We describe a new approach to partial symmetry breaking: using local search in the symmetry group to detect violated lex-leader constraints. The local search is interleaved with the backtrack search performed by the constrai...

متن کامل

Integrating Symmetry, Dominance, and Bound-and-Bound in a Multiple Knapsack Solver

The multiple knapsack problem (MKP) is a classical combinatorial optimization problem. A recent algorithm for some classes of the MKP is bin-completion, a bin-oriented, branch-and-bound algorithm. In this paper, we propose path-symmetry and path-dominance, which are instances of the symmetry detection by dominance detection approach for pruning symmetric nodes in the MKP branch-and-bound search...

متن کامل

Symmetries in Rectangular Block-Packing

The block-packing problem has applications in chip design, factory layout, container shipment optimization, scheduling and other areas. It has been actively studied in the last 20 years, but symmetry in packings has been neglected. Our work deals with symmetry in several formulations of block-packing, including optimization and constraint-satisfaction variants, as well as slicing and non-slicin...

متن کامل

A Chance Constraint Approach to Multi Response Optimization Based on a Network Data Envelopment Analysis

In this paper, a novel approach for multi response optimization is presented. In the proposed approach, response variables in treatments combination occur with a certain probability. Moreover, we assume that each treatment has a network style. Because of the probabilistic nature of treatment combination, the proposed approach can compute the efficiency of each treatment under the desirable reli...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007